Distributed Prediction Markets modeled by Weighted Bayesian Graphical Games
نویسندگان
چکیده
We consider a novel, yet practical setting of prediction markets called distributed prediction markets, where the aggregated price of a security of an event in one prediction market is affected dynamically by the prices of securities of similar events in other, simultaneously running prediction markets. We focus on the problem of decision making facing a market maker to determine the price of a security within such a setting. We propose a formal framework based on graphical games called a weighted Bayesian graphical game (WBGG) to model the distributed prediction market setting and to capture the local interactions between multiple market makers. We then describe a distributed message passing algorithm based on NashProp algorithm to calculate the Bayes-Nash equilibrium in a WBGG. We provide analytical results including convergence and incentivizing truthful revelation among market makers. Our experimental results show that market makers that consider the influence of other market makers in a distributed prediction market setting while using our proposed WBGG-based algorithm obtain higher utilities and set prices more accurately in comparison to market makers using a greedy strategy to set prices or those that do not consider the influence of other market makers. We also observe that extreme sizes of the neighborhood of a market maker have an adverse impact on its utilities.
منابع مشابه
Learning Parameters by Prediction Markets and Kelly Rule for Graphical Models
We consider the case where a large number of human and machine agents collaborate to estimate a joint distribution on events. Some of these agents may be statistical learners processing large volumes of data, but typically any one agent will have access to only some of the data sources. Prediction markets have proven to be an accurate and robust mechanism for aggregating such estimates (Chen an...
متن کاملExploiting Agent and Type Independence in Collaborative Graphical Bayesian Games
Efficient collaborative decision making is an important challenge for multiagent systems. Finding optimal joint actions is especially challenging when each agent has only imperfect information about the state of its environment. Such problems can be modeled as collaborative Bayesian games in which each agent receives private information in the form of its type. However, representing and solving...
متن کاملDeep Factor Graphs for Bayesian Prediction of High- Dimensional Games
This paper offers an extension to TrueSkill, a Bayesian method for ranking players and predicting outcomes of multiplayer games, for cases where a game is highdimensional. TrueSkill was originally developed by Microsoft Research to rank and match XBox Live players, but offers a general method for inferring player skill based almost exclusively on the win-loss outcome of a match. Although such a...
متن کاملBayesian Prediction Intervals under Bivariate Truncated Generalized Cauchy Distribution
Ateya and Madhagi (2011) introduced a multivariate form of truncated generalized Cauchy distribution (TGCD), which introduced by Ateya and Al-Hussaini (2007). The multivariate version of (TGCD) is denoted by (MVTGCD). Among the features of this form are that subvectors and conditional subvectors of random vectors, distributed according to this distribution, have the same form of distribution ...
متن کاملRobust Opponent Modeling in Real-Time Strategy Games using Bayesian Networks
Opponent modeling is a key challenge in Real-Time Strategy (RTS) games as the environment is adversarial in these games, and the player cannot predict the future actions of her opponent. Additionally, the environment is partially observable due to the fog of war. In this paper, we propose an opponent model which is robust to the observation noise existing due to the fog of war. In order to cope...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013